Asymptotically Good Binary Linear Codes With Asymptotically Good Self-Intersection Spans

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotically Good Quantum Codes

Using algebraic geometry codes we give a polynomial construction of quantum codes with asymptotically non-zero rate and relative distance.

متن کامل

Asymptotically Good Convolutional Codes

In this paper, we construct new sequences of asymptotically good convolutional codes (AGCC). These sequences are obtained from sequences of transitive, self-orthogonal and self-dual algebraic geometry (AG) codes attaining the Tsfasman-Vladut-Zink bound. Furthermore, by applying the techniques of expanding, extending, puncturing, direct sum, the 〈u|u+ v〉 construction and the product code constru...

متن کامل

Asymptotically good sequences of curves and codes

The parameters of a linear block code over the finite field Fq of length n, dimension k and minimum distance d will be denoted by [n, k, d]q or [n, k, d]. The quotient k/n is called the information rate and denoted by R = k/n and the relative minimum distance d/n is denoted by δ. A sequence of codes (Cm|m ∈ N) with parameters [nm, km, dm] over a fixed finite field Fq is called asymptotically go...

متن کامل

Asymptotically Good Codes Over Non-Abelian Groups

In this paper, we show that good structured codes over non-Abelian groups do exist. Specifically, we construct codes over the smallest non-Abelian group D6 and show that the performance of these codes is superior to the performance of Abelian group codes of the same alphabet size. This promises the possibility of using non-Abelian codes for multi-terminal settings where the structure of the cod...

متن کامل

Asymptotically Good Generalized Algebraic Geometry Codes

Preface In any form of electronic communication, errors can occur and hence there is a need to deal with them. Before error-correcting codes were used, only once a message had been received and could not be understood, one could conclude that errors had occurred. There was no way to resolve these errors other than asking for retransmission. This changed when Claude Shannon in 1948 proved a theo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2013

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2013.2237944